Is Evolution Algorithmic?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolution Algorithmic ?

In Darwin’s Dangerous Idea, Daniel Dennett claims that evolution is algorithmic. On Dennett’s analysis, evolutionary processes are trivially algorithmic because he assumes that all natural processes are algorithmic. I will argue that there are more robust ways to understand algorithmic processes which make the claim that evolution is algorithmic empirical and not conceptual. While laws of natur...

متن کامل

Algorithmic Information & Evolution

A theory of information and computation has been developed: " algo-rithmic information theory. " Two books [11–12] have recently been published on this subject, as well as a number of nontechnical discussions [13–16]. The main thrust of algorithmic information theory is twofold: (1) an information-theoretic mathematical definition of random sequence via algorithmic incompressibility, and (2) st...

متن کامل

Algorithmic Feasibility of Observing Artificial Life Evolution

An observation process is a fundamental implicit component of the simulation based studies on artificial-evolutionary systems (AES) by which time-varying entities are identified and their behavior is observed to uncover higher-level “emergent” phenomena. In this paper, we analyze algorithmic feasibility of implementing an observation process and consequent automated discovery of the entities an...

متن کامل

An algorithmic approach to knowledge evolution

Intelligent agents must update their knowledge base as they acquire new information about their environment The modal logic S n has been designed for representing knowledge bases in societies of agents Halpern and Vardi have proposed the notion of re nement of S n Kripke models in order to solve multi agent problems in which knowledge evolves We argue that there are some problems with their pro...

متن کامل

Cat(0) Is an Algorithmic Property

In this article we give an explicit algorithm which will determine, in a discrete and computable way, whether a finite piecewise Euclidean complex is non-positively curved. In particular, given such a complex we show how to define a boolean combination of polynomial equations and inequalities in real variables, i.e. a real semi-algebraic set, which is empty if and only if the complex is non-pos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Minds and Machines

سال: 2009

ISSN: 0924-6495,1572-8641

DOI: 10.1007/s11023-009-9170-6